int FactorialSum( List L )
{
	struct Node *p;
	int sum;
	for(p=L;p!=NULL;p=p->next)
	{
		sum+=fact(p->Data);
	}
	return sum;
}

int fact(int n)
{
	if(n<=1)
	{
		return 1;
	}
	else
	{
		return n*fact(n-1);
	}
}
